GRANULARITY OF LOCKS IN A SHARED DATA BASE bY

نویسندگان

  • J. N. Gray
  • R. A. Lorie
  • G. R. Putzolu
چکیده

This paper proposes a locking protocol which associates locks with sets of resources. This protocol allows simultaneous locking at various granularities by different transactions. It is based on the introduction of additional lock modes besides the conventional share mode and exclusive mode. The protocol is generalized from simple hierarchies of locks to directed acyclic graphs of locks and to dynamic graphs of locks. The issues of scheduling and granting conflicting requests for the same resource are then discussed. Lastly, these ideas are compared with the lock mechanisms provided by existing data management systems. This work was supported by IBM. Author's address: K55-282, IBM, Monterey and Cottle Rds., San Jose, California 95193.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Granularity of Locks and Degrees of Consistency in a Shared Data Base

The problem of choosing the appropriate Hranularit~ (size) of lockable objects is introduced and the tradeoff between concurrency and overhead is discusseS. A locking protocol which allows simultaneous locking at various granularities by different transactions is presented. It is based on the introduction of additional lock modes besides the conventional share mode an5 exclusive mode. A proof i...

متن کامل

Efficient Locking and Caching of Data in the Multisystem Shard Disks Transaction Environment

This paper describes a technique for use when multiple instances of a data base management system (DBMS), each with its own cache (buffer pool), can directly read and modify any data stored on a set of shared disks. Global locking and coherency control protocols are necessary in this context for assuring transaction consistency and for maintaining coherency of the data cached in the multiple ca...

متن کامل

An Analysis of Synchronization Mechanisms in Shared-Memory Multiprocessors

The granularity of computation achievable in a shared-memory multiprocessor is limited by the time required for process communication, that is, synchronization and data sharing. Therefore, reducing delays associated with process communication directly affects the minimum parcel of computation that can be efficiently executed. QOLB (formerly called QOSB) is a recently proposed hardware primitive...

متن کامل

Architecture of Oracle Parallel Server

Oracle Parallel Server (OPS) is a shared disk RDBMS. We present a high level overview of the main architectural issues of OPS and their evolution throughout the releases of the Oracle database. The Oracle relational database can be used either in exclusive or shared mode. In exclusive (the most traditional) mode only one Oracle instance can mount or open the database. The Oracle Parallel Server...

متن کامل

A Comparative Study on the Mechanism, Form and Decorations of Contemporary Chaleshtor Locks and Those from the Safavid Isfahan

Lock is a device that assures safety of human’s life. Iranian locksmiths, in addition to making locks and meeting the essential needs, valued the decorative aspects of such tools. Including pendants and movable types, these locks are portable and they are different from standard, ordinary ones. Artists in this field have incorporated a wide range of artistic, spiritual, cultural and aesthetic v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998